Sacks forcing and the shrink wrapping property

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sacks Forcing and the Shrink Wrapping Property

We consider a property stronger than the Sacks property which holds between the ground model and the Sacks forcing extension. 1. The Shrink Wrapping Property Suppose that V is a Sacks forcing extension of a model M . Then the Sacks property holds between V and M . That is, for each x ∈ ω, there exists a tree T ⊆ ω in M such that x ∈ [T ] and each level of T is finite. The following is a stronge...

متن کامل

Sacks forcing, Laver forcing, and Martin's axiom

In this paper we study the question assuming MA+¬CH does Sacks forcing or Laver forcing collapse cardinals? We show that this question is equivalant to question of what is the additivity of Marczewski’s ideal s. We give a proof that it is consistent that Sacks forcing collapses cardinals. On the other hand we show that Laver forcing does not collapse cardinals. Introduction Let S be Sacks perfe...

متن کامل

Arithmetical Sacks Forcing

We answer a question of Jockusch by constructing a hyperimmunefree minimal degree below a 1-generic one. To do this we introduce a new forcing notion called arithmetical Sacks forcing. Some other applications are presented.

متن کامل

Projective Absoluteness under Sacks Forcing

We show that Σ3-absoluteness under Sacks forcing is equivalent to the Sacks measurability of every ∆2 set of reals. We also show that Sacks forcing is the weakest forcing notion among all of the preorders which always add a new real with respect to Σ3 forcing absoluteness.

متن کامل

Shrink-Wrapping trajectories for Linear Programming

Hyperbolic Programming (HP) –minimizing a linear functional over an affine subspace of a finite-dimensional real vector space intersected with the so-called hyperbolicity cone– is a class of convex optimization problems that contains well-known Linear Programming (LP). In particular, for any LP one can readily provide a sequence of HP relaxations. Based on these hyperbolic relaxations, a new Sh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fundamenta Mathematicae

سال: 2020

ISSN: 0016-2736,1730-6329

DOI: 10.4064/fm688-2-2019